Structural complexity theory - PDFSEARCH.IO - Document Search Engine

Structural complexity theory
Results: 144

#	Item
101	Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Christian Glaßer ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 15:16:38 Complexity classes Computability theory Structural complexity theory Mathematical optimization NP-complete NP P versus NP problem Oracle machine Function Theoretical computer science Computational complexity theory Applied mathematics
102	Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 08:38:33 Structural complexity theory Complexity classes Functions and mappings Computability theory NP Multivalued function Oracle machine Time hierarchy theorem Inverse function Theoretical computer science Mathematics Computational complexity theory
103	Non-Mitotic Sets Christian Glasser∗, Alan L. Selman†, Stephen Travers‡, and Liyu Zhang§ 22nd June[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-06-22 10:53:44 Complexity classes Computability theory Structural complexity theory Mathematical optimization Many-one reduction NP-complete NP PP Reduction Theoretical computer science Computational complexity theory Applied mathematics
104	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:46:24 Complexity classes Structural complexity theory Mathematical optimization Conjectures P versus NP problem NP P Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
105	The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-11-08 15:58:52 Complexity classes Computability theory NP-complete problems Structural complexity theory Polynomial hierarchy NP PP Many-one reduction Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
106	Communicating ASP and the Polynomial Hierarchy Kim Bauters1, , Steven Schockaert1, , Dirk Vermeir2 , and Martine De Cock1 1 Department of Applied Mathematics and Computer Science Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2011-07-25 12:41:03 Logic programming Complexity classes Structural complexity theory Boolean algebra Stable model semantics True quantified Boolean formula Answer set programming FO Polynomial hierarchy Theoretical computer science Computational complexity theory Applied mathematics
107	Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 14:54:47 Complexity classes Structural complexity theory Conjectures Mathematical optimization P versus NP problem PP NP Polynomial hierarchy P Theoretical computer science Computational complexity theory Applied mathematics
108	Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-12-27 11:32:14 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP PP Polynomial hierarchy PSPACE-complete P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
109	Optimal acceptors and optimal proof systems Edward A. Hirsch? Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg[removed], Russia http://logic.pdmi.ras.ru/~hirsch/ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2010-03-28 09:40:37 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem Propositional proof system PP Mathematical proof Theoretical computer science Computational complexity theory Applied mathematics
110	Hints Really Help! Rasil Warnakulasooriya & David E. Pritchard Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge, MA 02139. Add to Reading List Source URL: relate.mit.edu Language: English - Date: 2012-02-06 21:54:40 Computational complexity theory Reduction Structural complexity theory Angular momentum Momentum Physics Conservation laws Physical quantities

UPDATE